Simulated Annealing Based Placement Algorithms and Research Challenges: a Survey
نویسندگان
چکیده
In this survey paper, we have done a comprehensive study of VLSI placement algorithms in the literature and classified them from different perspectives. After an extensive review, we have performed a chronological analytical study of the simulated annealing based placement algorithm. We have explored the pros and cons of simulated annealing based placement along with its applications. To the best of our knowledge, there is no state of the art survey on the simulated annealing based placement algorithms in the literature till date. This motivated us to make a survey on simulated annealing based placement algorithms. We have explored some of the research issues and challenges to open up future directions of research work in this area. We have also addressed some research issues and suggested few directions to fill up the research gap.
منابع مشابه
Essential Issues in Analytical Placement Algorithms
The placement problem is to place objects into a fixed die such that no objects overlap with each other and some cost metric (e.g., wirelength) is optimized. Placement is a major step in physical design that has been studied for several decades. Although it is a classical problem, many modern design challenges have reshaped this problem. As a result, the placement problem has attracted much att...
متن کاملA Routing-Aware Simulated Annealing-based Placement Method in Wireless Network on Chips
Wireless network on chip (WiNoC) is one of the promising on-chip interconnection networks for on-chip system architectures. In addition to wired links, these architectures also use wireless links. Using these wireless links makes packets reach destination nodes faster and with less power consumption. These wireless links are provided by wireless interfaces in wireless routers. The WiNoC archite...
متن کاملPMU Placement Methods in Power Systems based on Evolutionary Algorithms and GPS Receiver
In this paper, optimal placement of Phasor Measurement Unit (PMU) using Global Positioning System (GPS) is discussed. Ant Colony Optimization (ACO), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) are used for this problem. Pheromone evaporation coefficient and the probability of moving from state x to state y by ant are introduced into the ACO. The modifi...
متن کاملComparison of Simulated Annealing and Electromagnetic Algorithms for Solution of Extended Portfolio Model
This paper presents two meta-heuristic algorithms to solve an extended portfolio selection model. The extended model is based on the Markowitz's Model, aiming to minimize investment risk in a specified level of return. In order to get the Markowitz model close to the real conditions, different constraints were embedded on the model which resulted in a discrete and non-convex solution space. ...
متن کاملParallel simulated annealing strategies for VLSI cell placement
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been undertaken to parallelize this algorithm. Most previous parallel approaches to cell placement annealing have used a parallel moves approach. In this paper we investigate two new approaches that have been proposed for gen...
متن کامل